package leetcode.weekly.week297;

import leetcode.helper.H;

public class Solution2Test extends H {

	public void debug4(Solution2 so) {
		H.compare(17, so.minPathCost(H.str2array1("[[5,3],[4,0],[2,1]]"),
				H.str2array1("[[9,8],[1,5],[10,12],[18,6],[2,4],[14,3]]")));
		H.compare(6, so.minPathCost(H.str2array1("[[5,1,2],[4,0,3]]"),
				H.str2array1("[[12,10,15],[20,23,8],[21,7,1],[8,1,13],[9,10,25],[5,3,2]]")));
	}

	public void debug3(Solution2 so) {
//		H.compare(so, so);
	}

	public void debug2(Solution2 so) {
//		H.compare(so, so);
	}

	public void debug1(Solution2 so) {
//		H.compare(so, so);
	}

	public static void main(String[] args) {
		Solution2Test test = new Solution2Test();
		Solution2 so = new Solution2();
		test.debug1(so);
		test.debug2(so);
		test.debug3(so);
		test.debug4(so);
	}

}
